An Intensional Formalization of Generic Statements

نویسندگان

چکیده

Abstract A statement is generic if it expresses a generalization about the members of kind, as in, ’Pear trees blossom in May,’ or, ’Birds lay egg’. In classical logic, statements are formalized universally quantified conditionals: ‘For all x, if..., then....’ We want to argue that such logical interpretation fails capture intensional character because cannot express simple proposition Aristotle’s sense, i.e., containing only one single predicate. On contrary, we show typed lambda-abstraction can help us transform classical, non-simple and extensional expression into new, formalization, through introduction an abductively defined operator ALL *. This new allows for possibility predication, e.g. fly (), builds, out concept like ‘bird’, concrete universal, ‘birds’, upon which predicate be applied authentically formalize statement, ‘birds fly’.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formalization of Concepts for Generic Programming

Generic programming is a paradigm for systematic design and classification of software components for optimal reuse. It has been the guiding methodology behind the design of the C++ Standard Template Library and numerous other C++ libraries. Generic programming starts with algorithms, seeking to identify the minimal requirements on types necessary for correct and efficient execution of an algor...

متن کامل

Extracting Generic Statements for the Semantic Web

Much of the natural language text found on the web contains various kinds of common sense knowledge and such information is potentially an important supplement to more formal approaches to building knowledge bases for Semantic Web applications. The common sense knowledge is often expressed in the form of generic statements such as “Elephants are mammals.” The generic statement refers to a sente...

متن کامل

An Intensional Schrödinger Logic

We investigate the higher-order modal logic SωI , which is a variant of the system Sω presented in our previous work. A semantics for that system, founded on the theory of quasi sets, is outlined. We show how such a semantics, motivated by the very intuitive base of Schrödinger logics, provides an alternative way to formalize some intensional concepts and features which have been used in recent...

متن کامل

Morphosyntactic and Referential Cues to the Identification of Generic Statements

Generic sentences (e.g., “birds lay eggs”) express generalizations about kinds, rather than facts about specific individuals or groups of individuals (e.g., “all birds lay eggs”). Generics are an important method of transmitting cultural knowledge, but because there is no unique marker of genericity, identifying whether a sentence is generic is a challenge. Here we investigated how morphosyntac...

متن کامل

Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers

Modern propositional satisfiability (or SAT) solvers are very powerful due to recent developments on the underlying data structures, the used heuristics to guide the search, the deduction techniques to infer knowledge, and the formula simplification techniques that are used during preand inprocessing. However, when all these techniques are put together, the soundness of the combined algorithm i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logica Universalis

سال: 2023

ISSN: ['1661-8300', '1661-8297']

DOI: https://doi.org/10.1007/s11787-023-00323-1